Sharing a Verifiable Secret Image using Forward Error Correction Code for Halftone Image
نویسندگان
چکیده
A novel verifiable secret sharing method for Verifiable secret sharing (VSS) in halftone image based on linear block code with a parity check matrix is proposed. The proposed method, which not only verifies a secret image but also introduces multiple shadows for multiple users. The proposed method adopts forward error correction code (FEC) strategy based on property of linear block codes. There are three advantages for the proposed method: (1)the proposed scheme is capable of offering multiple shadows, (2) The proposed scheme is of low computational cost and (3)The novel VSS allows users to verify the shadows or enhance the robustness of original shadows. Experimental results show that the proposed scheme is capable of efficiently verifying a secret image from a variety of users. Moreover, the VSS process multiple shadows without pixel expansion. The experimental results show that the novel VSS scheme is low computational complexity. Keywords— Hamming code, Visual secret sharing, halftone image, Error diffusion.
منابع مشابه
Steganography Scheme Based on Reed-Muller Code with Improving Payload and Ability to Retrieval of Destroyed Data for Digital Images
In this paper, a new steganography scheme with high embedding payload and good visual quality is presented. Before embedding process, secret information is encoded as block using Reed-Muller error correction code. After data encoding and embedding into the low-order bits of host image, modulus function is used to increase visual quality of stego image. Since the proposed method is able to embed...
متن کاملLinear Secret Sharing from Algebraic-Geometric Codes
It is well-known that the linear secret-sharing scheme (LSSS) can be constructed from linear error-correcting codes (Brickell [1], R.J. McEliece and D.V.Sarwate [2],Cramer, el.,[3]). The theory of linear codes from algebraic-geometric curves (algebraic-geometric (AG) codes or geometric Goppa code) has been well-developed since the work of V.Goppa and Tsfasman, Vladut, and Zink( see [17], [18] a...
متن کاملPerformance of Error Filters on Shares in Halftone Visual Cryptography via Error Diffusion
Visual cryptography encodes a secret binary image (SI) into shares of random binary patterns. The decoding process of a visual cryptography scheme, which differs from traditional secret sharing, does not need any cryptographic algorithms like symmetric and asymmetric algorithms. Visual cryptography is based on the images and is obtained by sending pixel information and stacking of pixels for re...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملPrivilege Based Advance Halftone Secure Secret Sharing Scheme with Error Diffusion Technique Along with Adaptive Secure Confidential Key in the Visual Cryptography
In the area of medicine, storing medical images of the patient in a very secure manner becomes to be toughest challenge. As the development in the digitalization of medicine, medical images security becomes critical issues for providing the secure transmission of data and images over unsecured channels. To overcome such issues, visual cryptography has been introduced using cryptographic mechani...
متن کامل